Ogden's Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
نویسنده
چکیده
Abstract. I present a simple example of a multiple context-free language for which a very weak variant of generalized Ogden’s lemma fails. This language is generated by a non-branching (and hence well-nested) 3MCFG as well as by a (non-well-nested) binary-branching 2-MCFG; it follows that neither the class of well-nested 3-MCFLs nor the class of 2-MCFLs is included in Weir’s control language hierarchy, for which Palis and Shende proved an Ogden-like iteration theorem. I then give a simple su cient condition for an MCFG to satisfy a natural analogue of Ogden’s lemma, and show that the corresponding class of languages is a substitution-closed full AFL which includes Weir’s control language hierarchy. My variant of generalized Ogden’s lemma is incomparable in strength to Palis and Shende’s variant and is arguably a more natural generalization of Ogden’s original lemma.
منابع مشابه
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars
The pumping lemma and Ogden lemma offer a powerful method to prove that a particular language is not context-free. In 2008 Kanazawa proved an analogue of pumping lemma for well-nested multiplecontext free languages. However, the statement of lemma is too weak for practical usage. We prove a stronger variant of pumping lemma and an analogue of Ogden lemma for the class of tree-adjoining language...
متن کاملA Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...
متن کاملToo many languages satisfy Ogden's Lemma
There are various pumping lemmata for context free languages, the strongest of which is Ogden’s Lemma. It is known that it does not fully characterize context free languages. In an attempt to remedy the situation, Manaster– Ramer, Moshier and Zeitman have strengthened this lemma. As we shall show here, there exist non–semilinear languages that satisfy this stronger lemma and also the lesser kno...
متن کاملOgden’s Lemma for Random Permitting and Forbidding Context Picture Languages and Table-Driven Context-Free Picture Languages
Random context picture grammars are used to generate pictures through successive refinement. There are three important subclasses of random context picture grammars, namely random permitting context picture grammars, random forbidding context picture grammars and table-driven context-free picture grammars. These grammars generate the random permitting context picture languages, random forbiddin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016